package leetcode;

import pojo.TreeNode;

/**
 * 110. 平衡二叉树   https://leetcode.cn/problems/balanced-binary-tree/
 *
 * @author yujiafan
 * @version 1.0.0
 * @create 2022-12-30
 */
public class LeetCode110 {

    public static class Info {
        int height;
        boolean isBBT;

        public Info(int height, boolean isBBT) {
            this.height = height;
            this.isBBT = isBBT;
        }
    }

    public static Info process(TreeNode root){
        if(root.left == null && root.right == null){
            return new Info(0,true);
        }
        int height = 0;
        boolean isBBT;
        if(root.left != null && root.right != null){
            // TODO
        }
        return null;
    }

    public static boolean isBalanced(TreeNode root) {
        if(root == null){
            return false;
        }
        return process(root).isBBT;
    }
}
